On the revealed preference analysis of stable aggregate matchings

Echenique, Lee, Shum, and Yenmez (2013) established the testable revealed preference restrictions for stable aggregate matching with transferable nontransferable utility extremal matchings. In this paper, we rephrase their in terms of properties on a corresponding bipartite graph. From this, obtain simple condition that verifies whether given is rationalizable. For matchings are not rationalizable, provide greedy algorithm computes minimum number matches need to be removed rationalizable matching. We also show related problem finding types remove order NP‐complete.